# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def earliestFullBloom(self, plantTime: List[int], growTime: List[int]) -> int:
        array = list(zip(plantTime, growTime))
        # 按照growTime的降序排列
        array.sort(key=lambda x: -x[1])

        day, ans = 0, 0
        for flower in array:
            day += flower[0]
            # 对于第2个元素
            # ans = p0 + g0
            # day = p0 + p1
            # max = (p0 + g0, p0 + p1 + g1)
            ans = max(ans, day + flower[1])

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 4, 3], [2, 3, 1], 9),
        ([1, 2, 3, 2], [2, 1, 2, 1], 9),
        ([1], [1], 2)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.earliestFullBloom(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

